Generalized SOR-Like Iteration Method for Linear Complementarity Problem
نویسندگان
چکیده
منابع مشابه
Modulus-based GSTS Iteration Method for Linear Complementarity Problems
In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters...
متن کاملA Damped Guass-Newton Method for the Generalized Linear Complementarity Problem
In this paper, we consider the generalized linear complementarity problem (GLCP) over an affine subspace. To this end, we first reformulate the GLCP as a system of nonsmooth equation via the Fischer function. Based on this reformulation, the famous damped Gauss-Newton (DGN) algorithm is employed for obtaining its solution, and we show that the DGN algorithm is quadratically convergent without n...
متن کاملOn generalized SSOR-like iteration method for saddle point problems
In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...
متن کاملA New Interior Point Method for Linear Complementarity Problem
named interior points set of the LCP (M, q) must be nonempty. The aim of this paper is to show that the LCP (M, q) is completely equivalent to a convex quadratic programming problem (CQPP ) under linear constraints. To solve the second problem, we propose an iterative method of interior points which converge in polynomial time to the exact solution; this convergence requires at most o(n0,5L) it...
متن کاملAn Algebraic Elimination Method for the Linear Complementarity Problem
A new method namely, algebraic elimination method is proposed for finding a complementarity feasible solution to the linear complementarity problem which have applications in non-linear programming, economics, game theory and engineering. Then, the algebraic elimination method is extended to quadratic programming problems. The solution procedure is illustrated by means of numerical examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2020/6314798